package com.lft.graph03.shortest_path_graph01_dijkstra02;

import java.util.ArrayList;
import java.util.List;

/**
 * 记录各个顶点路径信息的类
 */
public class Distance {
	List<Integer> path;
	int value;
	boolean visit;
	
	public Distance() {
		visit = false;
		value = 0;
		path = new ArrayList<>();
	}
}